例句與造句

1. Inimum network problem and its time - based polynomial algorithm
   最小網(wǎng)絡(luò)問(wèn)題及其多項(xiàng)式時(shí)間算法
2. A polynomial algorithm for minimum - cardinality feedback vertex set problem in outerplanar graphs
   一個(gè)求外平面圖最小反饋點(diǎn)集的多項(xiàng)式時(shí)間算法
3. That is to say , we can not use any polynomial algorithm to solve this kind of problems
   也就是說(shuō)，不能用任何已知的多項(xiàng)式算法求解這種問(wèn)題。
4. Four special capacity expansion problem of undirected network were discussed and the responsible strongly polynomial algorithm was get
   討論了無(wú)向網(wǎng)絡(luò)容量擴(kuò)充的4種特殊問(wèn)題，給出了相應(yīng)的強(qiáng)多項(xiàng)式算法
5. Furthermore , the vertex - neighbor - scattering number of trees is discussed in details . the main contents of chapter 4 are the introduction of edge - neighbor - scattering number of graphs , the edge - neighbor - scattering number values of several simple graphs and a polynomial algorithm of the edge - neighbor - scattering number of trees
   第四章主要定義圖的邊鄰域離散數(shù)，給出一些基本圖的邊鄰域離散數(shù)值，圖的邊鄰域離散數(shù)的界，樹(shù)的邊鄰域離散數(shù)的一個(gè)多項(xiàng)式算法。
6. It's difficult to find polynomial algorithm in a sentence. 用polynomial algorithm造句挺難的
7. Firstly , a 0 - 1 integer programming mathematical model is constructed to describe tail - number - assigning work happened in domestic airline , since the problem is npc , a unified polynomial algorithm which satisfies engineering requirement is unavailable . illuminated by the practical experience , a specific tna problem is classified into one of three typical tna modes : tna based on fleet dispatching commands , tna based on fleet balance application , tna based on minimum fleet requirement ; secondly , by simplifying and relaxing some minor constraints , corresponding mathematical models and heuristic algorithms are reconstructed for each typical tna mode ; finally , computing complexities are discussed
   為此論文在借鑒手工編制排班計(jì)劃經(jīng)驗(yàn)的基礎(chǔ)上，將一個(gè)具體的飛機(jī)排班問(wèn)題，歸結(jié)為三種典型排班模式中的一種，即：基于飛機(jī)調(diào)度指令要求的排班問(wèn)題，基于飛機(jī)使用均衡要求的排班問(wèn)題和基于最少需用飛機(jī)數(shù)的排班問(wèn)題，對(duì)于每種典型的飛機(jī)排班模式，在對(duì)次要的約束條件進(jìn)行簡(jiǎn)化、松馳的基礎(chǔ)上構(gòu)造出相應(yīng)的能夠滿足工程應(yīng)用要求的啟發(fā)式算法，并分析了算法的復(fù)雜性。
8. Abstract : in this paper , we discussed a new kind of single machine scheduling problems with controllable processing times . the objective function being considered was the sum of weighted completion times of all jobs plus the maximum dissatisfaction of all jobs ' processing times that deviated from their specified ones . we presented a polynomial algorithm to solve the problem
   文摘:本文討論了一類新的加工時(shí)間可控的單機(jī)排序問(wèn)題.我們所考慮的目標(biāo)函數(shù)由所有工件的加權(quán)完工時(shí)間之和與對(duì)所有工件的實(shí)際加工時(shí)間偏離額定加工時(shí)間的最大不滿意程度這兩部分組成.對(duì)此問(wèn)題,我們提出了一個(gè)多項(xiàng)式算法